Inductive assertion method for logic programs

Assertion based Inductive Verification Methods for Logic Programs

This paper is an overview of our results on the application of abstract interpretation concepts to the derivation of a verification method for logic programs. These include the systematic design of semantics modeling various proof methods and the characterization of assertions as abstract domains. We first apply the verification framework defined in [5] to derive inductive sufficient conditions...

An Assertion Language for Constraint Logic Programs

In an advanced program development environment, such as that discussed in the introduction of this book, several tools may coexist which handle both the program and information on the program in different ways. Also, these tools may interact among themselves and with the user. Thus, the different tools and the user need some way to communicate. It is our design principie that such communication...

The Prioritized Inductive Logic Programs

The limit behaviors of an inductive logic program should be an important research topic which has not been explored. An inductive logic program is convergent if given an increasing sequence of example sets, the inductive logic program should produce a corresponding sequence of the Horn logic programs which has the settheoretic limit; limit-correct if the limit of the produced sequence of the Ho...

Inductive Equivalence of Logic Programs

Inductive Tight Semantics for Logic Programs

The Gelfond-Lifschitz operator fixed-point requirement by Stable Models induces asymmetry in dealing with Even Loops and Odd Loops Over Negation. We introduce a 2-valued semantics for Normal Logic Programs — the Inductive Tight semantics (ITS) — that generalizes SM semantics by dealing uniformly with Even and Odd loops.ITS conservatively extends the SM semantics (all SMs are Tight models), enjo...